The almost-entropic regions are not semialgebraic
نویسندگان
چکیده
We prove that the almost-entropic region of order four is not semialgebraic, we get as a corollary Matus’ Theorem, which asserts that the almost-entropic regions of order larger than four are not polyhedral. We discuss the algorithmic consequences of our result.
منابع مشابه
Parametrization of Semialgebraic Sets Imacs Symposium Sc{1993
In this paper we consider the problem of the algorithmic parametrization of a d-dimensional semialgebraic subset S of I R n (n > d) by a semialgebraic and continuous mapping from a subset of I R d. Using the Cylindrical Algebraic Decomposition algorithm we easily obtain semialgebraic, bijective parametrizations of any given semialgebraic set, but in this way some topological properties of S (su...
متن کاملComputing the homology of basic semialgebraic sets in weak exponential time
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of data the cost of the algorithm is exponential in the size of the data. All algorithms previously proposed for this problem have a complexity which is doubly ...
متن کاملMatrix Convex Hulls of Free Semialgebraic Sets
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...
متن کاملSemialgebraic complexity of functions
In this paper we study the rate of the best approximation of a given function by semialgebraic functions of a prescribed ‘‘combinatorial complexity’’. We call this rate a ‘‘Semialgebraic Complexity’’ of the approximated function. By the classical Approximation Theory, the rate of a polynomial approximation is determined by the regularity of the approximated function (the number of its continuou...
متن کاملMetric Properties of Semialgebraic Mappings
We give an effective estimation from above for the local Łojasiewicz exponent for separation of semialgebraic sets and for a semialgebraic mapping on a closed semialgebraic set. We also give an effective estimation from below of the Łojasiewicz exponent in the global separation for semialgebraic sets and estimation of the Łojasiewicz exponent at infinity of a semialgebraic mapping similar to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1510.02658 شماره
صفحات -
تاریخ انتشار 2015